Determining the automorphism group of the linear ordering polytope
نویسندگان
چکیده
منابع مشابه
Determining the automorphism group of the linear ordering polytope
In this paper we explore the combinatorial automorphism group of the linear ordering polytope P n LO for each n > 1. We establish that this group is isomorphic to Z 2 Sym(n + 1) if n > 2 (and to Z 2 if n = 2). Doing so, we provide a simple and uniied interpretation of all the automorphisms.
متن کاملTHE AUTOMORPHISM GROUP OF FINITE GRAPHS
Let G = (V,E) be a simple graph with exactly n vertices and m edges. The aim of this paper is a new method for investigating nontriviality of the automorphism group of graphs. To do this, we prove that if |E| >=[(n - 1)2/2] then |Aut(G)|>1 and |Aut(G)| is even number.
متن کاملOn the relaxation polytope of the linear ordering problem
In the paper we investigate the linear ordering polytope P n. We consider the 3-dicycle relaxation polytope B n and give an example of a fractional vertex of B n such that all non-integral values of the vertex are not equal to 1=2. In this paper also we present a constructive operation (5-Extension) for generating new facets of the linear ordering polytope P n. By connecting MM obius ladders wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2001
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(00)00312-7